Experiences with the multi-level algorithm
نویسندگان
چکیده
منابع مشابه
Experiences with the multi - level algorithm
Small expectation values are difficult to measure in Monte Carlo calculations as they tend to get swamped by noise. Recently an algorithm has been proposed by Lüscher and Weisz [1] which allows one to measure expectation values which previously could not be measured reliably in Monte Carlo simulations. We will test our implementation of this algorithm by looking at Polyakov loop correlators and...
متن کاملMixed-mode Design: Experiences with Multi-level Macromodeling
For simulation in mixed-mode design appropriate macromodels have to be developed. A successful approach is the combination of analog and digital, time-continuous and time-discrete, behavioral and structural models to „mixed-signal macromodels“. Submodels on different levels of abstraction are combined, too (multi-level approach). Due to the complexity of such models, an automatic generation is ...
متن کاملA location-allocation model in the multi-level supply chain with multi-objective evolutionary approach
In the current competitive conditions, all the manufacturers’ efforts are focused on increasing the customer satisfaction as well as reducing the production and delivery costs; thus, there is an increasing concentration on the structure and principles of supply chain (SC). Accordingly, the present research investigated simultaneous optimization of the total costs of a chain and customer satisfa...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Improved Multi-Level Raytracing Algorithm
Previous work has used entry point search (EP search) to accelerate raytracing by avoiding redundant traversal of nodes in a KD tree. EP search works by identifying a node which may be used as a starting point for tracing a particular group of coherent rays, thus bypassing all nodes above it. This is most effective when all rays can be shown to be occluded, since a leaf or low inner node can of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Physics B - Proceedings Supplements
سال: 2003
ISSN: 0920-5632
DOI: 10.1016/s0920-5632(03)01750-x